Ascending and descending regions of a discrete Morse function
نویسندگان
چکیده
منابع مشابه
Ascending and descending regions of a discrete Morse function
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of our algorithm compared to similar existing results is that it works, at least theoretically, in any dimension. Practically, there are dimensional restrictions ...
متن کاملA New Modification of Morse Potential Energy Function
Interaction of meso — tetrakis (p-sulphonato phenyl) porphyrin (hereafter abbreviated to TSPP)with Na+ has been examined using HF level of theory with 6-31G* basis set. Counterpoise (CP)correction has been used to show the extent of the basis set superposition error (BSSE) on thepotential energy curves. The numbers of Na+ have a significant effect on the calculated potentialenergy curve (includ...
متن کاملAscending and Descending Conditional Independence Relations
We explore the conditional probabilistic independences of systems of random variables (I; JjK), to read \I is conditionally independent of J given K", which are ascending (I; JjK)) (I; JjK L) or descending (I; JjK L)) (I; JjK). The resulting abstract independence structures can be equivalently described by weak families of connected sets. Using, in addition, probabilistic representations of mat...
متن کاملAscending and Descending Walking Recognition using Smartphone
In the recent decades, activity recognition for human behavior monitoring has been one of the major interesting research subjects. This paper investigates fractal dimension (FD) as an effective feature for human activity recognition. The target activities are descending and ascending stairs, which are performed by six male participants. To testify the validity of feature, the classification met...
متن کاملPermutations with Ascending and Descending Blocks
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then provide the first bijective proofs of some known results. We also solve some problems posed in [4] by Eriksen, Freij, and Wästlund, who study derangements t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.11.001